Modal Boolean Connexive Logics: Semantics and Tableau Approach
نویسندگان
چکیده
منابع مشابه
Tableau Methods for Modal and Temporal Logics
This document is a complete draft of a chapter by Rajeev Gor e on \Tableau Methods for Modal and Temporal Logics" which is part of the \Handbook of Tableau Methods", edited by M. D'Agostino, D. Gabbay, R. H ahnle and J. Posegga, to be published in 1998 by Kluwer, Dordrecht. Any comments and corrections are highly welcome. Please email me at [email protected] The latest version of this documen...
متن کاملLabelled Tableau Calculi for Weak Modal Logics
Many normal and regular modal logics have simple formalizations in terms of labelled tableaux (cf. [3], [4]). But these modal logics have direct characterisation in terms of Kripke frames, and labels are naturally modelled on this kind of semantics. It is an interesting question whether this well known method can be extended to some congruent and monotonic modal logics, which are not characteri...
متن کاملTableau methods of proof for modal logics
1 Introduction: In [1] Fitch proposed a new proof proceedure for several standard modal logics. The chief characteristic of this was the inclusion in the object language, of symbols representing worlds in Kripke models. In this paper we incorporate the device into a tableau proof system and it is seen that the resulting (propositional) proof system is highly analogous to a classical first order...
متن کاملRelational Semantics for Modal Logics
Bernd{Holger Schlinglo Institut f ur Informatik, Technische Universitat M unchen, e-mail: [email protected] Wolfgang Heinle Institut f ur angewandte Mathematik, Universitat Bern, e-mail: [email protected] Abstract In this work we survey the connections between modal logic and relation algebra. We compare various modal and relational languages for the speci cation of reac...
متن کاملConnexive Modal Logic
Connexive logic is a neglected direction in non-classical logic. In the present paper, first an axiomatic system of connexive propositional logic is presented. This logic, C, is shown to be sound and complete with respect to a class of relational models. It seems that this semantics is, in fact, the first known intuitively plausible interpretation of a system of connexive logic. The presentatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Section of Logic
سال: 2019
ISSN: 2449-836X,0138-0680
DOI: 10.18778/0138-0680.48.3.05